A simulation-based immune genetic algorithm for the crane scheduling problem
نویسندگان
چکیده
The paper studied a multi-machine and multi-task warehouse crane scheduling problem. The collision between adjacent cranes needs to be avoided in the scheduling problem. Considering the involved operation requirement and condition, a process simulation model was formulated to evaluate a candidate crane schedule through rehearsing the crane operation process. Based on the process simulation, an immune genetic algorithm was developed to iteratively improve the crane schedule. The process simulation-based immune genetic algorithm was tested on a group of practical instances, which showed that it was effective for the crane scheduling problem.
منابع مشابه
Yard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملA new approach for constraining failure probability of a critical deteriorating system Yard crane scheduling in port container terminals using genetic algorithm
In this paper, we focus on a continuously deteriorating critical equipment which its failure cannot be measured by cost criterion. For these types of systems like military systems, nuclear systems, etc it is extremely important to avoid failure during the actual operation of the system. In this paper we propose an approach which constrains failure probability to a pre-specified value. This valu...
متن کاملA Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملAddressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm
Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...
متن کاملQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کامل